Lifted Cover Inequalities for Integer Programs Complexity
نویسندگان
چکیده
We investigate several complexity issues related to branch and cut algorithms for integer programming based on lifted cover inequalities LCIs We show that given a fractional point determining a violated LCI over all minimal covers is NP hard The main result is that there exists a class of knapsack instances for which any branch and cut algorithm based on LCIs has to evaluate an exponential number of nodes to prove optimality
منابع مشابه
Lifted flow cover inequalities for mixed 0-1 integer programs
We investigate strong inequalities for mixed 0-1 integer programs derived from flow cover inequalities. Flow cover inequalities are usually not facet defining and need to be lifted to obtain stronger inequalities. However, because of the sequential nature of the standard lifting techniques and the complexity of the optimization problems that have to be solved to obtain lifting coefficients, lif...
متن کاملLifted Cover Inequalities for Integer Programs Computation
We investigate the algorithmic and implementation issues related to the e ective and e cient use of lifted cover inequalities and lifted GUB cover inequalities in a branch and cut algorithm for integer programming We have tried various strategies on several test problems and we identify the best ones for use in practice
متن کاملLifted Cover Inequalities for 0-1 Integer Programs: Complexity
We investigate several complexity issues related to branch-and-cut algorithms for 0-1 integer programming based on lifted cover inequalities (LCIs). We show that given a fractional point, determining a violated LCI over all minimal covers is NP-hard. The main result is that there exists a class of 0-1 knapsack instances for which any branch-and-cut algorithm based on LCIs has to evaluate an exp...
متن کاملLifted Cover Inequalities for 0-1 Integer Programs: Computation
We investigate the algorithmic and implementation issues related to the eeective and eecient use of lifted cover inequalities and lifted GUB cover inequalities in a branch-and-cut algorithm for 0-1 integer programming. We have tried various strategies on several test problems and we identify the best ones for use in practice. Branch-and-cut, with lifted cover inequalities as cuts, has been used...
متن کاملSimple lifted cover inequalities and hard knapsack problems
We consider a class of random knapsack instances described by Chvátal, who showed that with probability going to 1, such instances require an exponential number of branch-and-bound nodes. We show that even with the use of simple lifted cover inequalities, an exponential number of nodes is required with probability going to 1. It is not surprising that there exist integer programming (IP) instan...
متن کامل